Co de nite Set Constraints
نویسندگان
چکیده
In this paper we introduce the class of co de nite set constraints This is a natural sub class of set constraints which when satis able have a greatest solution It is practically motivated by the set based analysis of logic programs with the greatest model semantics We present an algorithm solving co de nite set constraints and show that their satis a bility problem is DEXPTIME complete
منابع مشابه
Contributions à la sémantique de la programmation logique
This work can be split in two parts. First, we present a full formalisation of the semantics of de nite programs, in the calculus of inductive constructions. For this, we describe a formalisation of the proof of rst order terms uni cation obtained from a similar proof dealing with quasi-terms, thus showing in a general setting how partial functions can be considered in a system with total funct...
متن کاملAbstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs
Interpretation over Non-Deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs John P. Gallagher German Puebla Abstract Interpretation over Non-Deterministic Finite TreeInterpretation over Non-Deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs John P. Gallagher and Germ an Puebla 1 University of Bristol, Dept. of Computer Science, BS8 1UB Bristol, U...
متن کاملBi - inductive Structural Semantics ( Extended
We propose a simple order-theoretic generalization of set-theoretic inductive de nitions. This generalization covers inductive, co-inductive and bi-inductive de nitions and is preserved by abstraction. This allows the structural operational semantics to describe simultaneously the nite/terminating and in nite/diverging behaviors of programs. This is illustrated on the structural bi nitary small...
متن کاملBi-inductive Structural Semantics: (Extended Abstract)
We propose a simple order-theoretic generalization of set-theoretic inductive de nitions. This generalization covers inductive, co-inductive and bi-inductive de nitions and is preserved by abstraction. This allows the structural operational semantics to describe simultaneously the nite/terminating and in nite/diverging behaviors of programs. This is illustrated on the structural bi nitary small...
متن کاملGeneralising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
The submodular function minimization problem (SFM) is a fundamental problem in combinatorial optimization and several fully combinatorial polynomial-time algorithms have recently been discovered to solve this problem. The most general versions of these algorithms are able to minimize any submodular function whose domain is a set of tuples over any totally-ordered nite set and whose range includ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012